Quantum counterfeit coin problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Counterfeit Coin Problems

The counterfeit coin problem requires us to find all false coins from a given bunch of coins using a balance scale. We assume that the balance scale gives us only “balanced” or “tilted” information and that we know the number k of false coins in advance. The balance scale can be modeled by a certain type of oracle and its query complexity is a measure for the cost of weighing algorithms (the nu...

متن کامل

The general counterfeit coin problem

Given c nickels among which there may be a counterfeit coin, which can only be told apart by its weight being di erent from the others, and moreover b balances. What is the minimal number of weighings to decide whether there is a counterfeit nickel, if so which one it is and whether it is heavier or lighter than a genuine nickel. We give an answer to this question for sequential and nonsequenti...

متن کامل

SNIEDOVICH OR/MS Games: 3. Counterfeit Coin Problem OR/MS Games: 3. Counterfeit Coin Problem

In this discussion we examine two versions of the famous Counterfeit Coin Problem, focusing on their educational OR/MS content. It is shown that this problem provides an excellent environment for illustrating a number of fundamental OR/MS problem-solving concepts and methods related to decision making under uncertainty. A number of interactive modules are provided for experimentation with this ...

متن کامل

Solution to the Counterfeit Coin Problem and its Generalization

This work deals with a classic problem: ”Given a set of coins among which there is a counterfeit coin of a different weight, find this counterfeit coin using ordinary balance scales, with the minimum number of weighings possible, and indicate whether it weighs less or more than the rest”. The method proposed here not only calculates the minimum number of weighings necessary, but also indicates ...

متن کامل

Optimal non-adaptive solutions for the counterfeit coin problem

We give optimal solutions to all versions of the popular counterfeit coin problem obtained by varying whether (i) we know if the counterfeit coin is heavier or lighter than the genuine ones, (ii) we know if the counterfeit coin exists, (iii) we have access to additional genuine coins, and (iv) we need to determine if the counterfeit coin is heavier or lighter than the genuine ones. Moreover, ou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2012

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2012.05.039